A 5/2 n2-Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary Fields
نویسنده
چکیده
We prove a lower bound of 52n 2 3n for the rank of n n–matrix multiplication over an arbitrary field. Similar bounds hold for the rank of the multiplication in noncommutative division algebras and for the multiplication of upper triangular matrices.
منابع مشابه
Multiplication over Arbitrary Fields
We prove a lower bound of 52n2 3n for the rank of n n–matrix multiplication over an arbitrary field. Similar bounds hold for the rank of the multiplication in noncommutative division algebras and for the multiplication of upper triangular matrices.
متن کاملNew Lower Bounds for the Rank of Matrix Multiplication
The rank of the matrix multiplication operator for n×n matrices is one of the most studied quantities in algebraic complexity theory. I prove that the rank is at least 3n2−o(n2). More precisely, for any integer p ≤ n− 1 the rank is at least (3− 1 p+1 )n2 − (1 + 2p 2p p−1 ) )n. The previous lower bound, due to Bläser, was 5 2 n2−3n (the case p = 1). The new bounds improve Bläser’s bound for all ...
متن کاملA (5/2)n2-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication
We prove a lower bound of 5 2 n 2 ? 3n for the multiplicative complexity of n n{matrix multiplication over arbitrary elds. More general, we show that for any nite dimensional semisimple algebra A with unity, the multiplicative complexity of the multiplication in A is bounded from below by 5 2 dim A ? 3(n1 + + nt) if the decomposition of A = A1 At into simple algebras A = D n n contains only non...
متن کاملLower Bounds for Matrix Product
We prove lower bounds on the number of product gates in bilinear and quadratic circuits that compute the product of two n n matrices over finite fields. In particular we obtain the following results: 1. We show that the number of product gates in any bilinear (or quadratic) circuit that computes the product of two n n matrices over GF (2) is at least 3n2 o(n2). 2. We show that the number of pro...
متن کاملInner Rank and Lower Bounds for Matrix Multiplication
We develop a notion of inner rank as a tool for obtaining lower bounds on the rank of matrix multiplication tensors. We use it to give a short proof that the border rank (and therefore rank) of the tensor associated with n × n matrix multiplication over an arbitrary field is at least 2n − n + 1. While inner rank does not provide improvements to currently known lower bounds, we argue that this n...
متن کامل